Optimal allocation of electronic content - INFOCOM 2001. Proceedings. IEEE
نویسندگان
چکیده
The delivery of large files to single users, such as application programs for some Yersions of the erwisioned network computer, or movies, is expected by many to be one of the main requirements of communication networks. This requiresexpensivehigh bandwidth capacityaswell asfast and K1gh storage servers. Thk motivates multimedia providers to optimize the delivery dktances, as well asthe electroniccontentallocation. A hierarcIdcal architecture for providing the multimedia content was introduced by Nussbaumer,.Patel,Schaffa, and Sternbenz(INFOCOM 94). ‘l’hey atso introduced the trade-off between bandwidth and storage requirements for the placement of the content servers on the hierarchy tree. They found the best level of the hierarchy for the server location to minimize the total of the costs of communication and storage. Their algorithm is centralized. We solve the more general case where servers can be located at different levels of the tderarchy. Our algorithm is dktributed, and each node requires a limited memory capacity and computational power. Results for related approaches to caching design are of higher complexity. Results for related classic Operations Research problems are for centralized algorithms, mostly linear programming, that are not easy to convert into distributed algorithms. Instead, we observe that the use of dynamic programming is morenatural for distributed implementations.For thespecific problem at hand, we also managed to find a natural function (a generatiiation of the problem) that simplifies the combination operation used in dynamic programming. We also show how to map such contemporary problems to the area of classical plant location problems in Operations Research.
منابع مشابه
Optimal Allocation of Electronic Content
The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of the main requirements of communication networks. This requires expensive high bandwidth capacity as well as fast and high storage servers. This motivates multimedia providers to optimize the delivery distances, as well as the...
متن کاملOptimal Multiple FCLs Allocation Considering DG Penetration in Meshed Network With Multi-Level Voltages
Increasing the short circuit current due to the penetration of distributed generations (DGs) in various voltage levels and meshed topology is a basic problem in power systems. Using fault current limiter (FCL) is an efficient approach to mitigate the exceeded short circuit levels. In this paper, a new approach is presented for multiple FCLs locating to decrease short circuit levels in meshed ne...
متن کاملOptimal DG Allocation and Thyristor-FCL Controlled Impedance Sizing for Smart Distribution Systems Using Genetic Algorithm
Recently, smart grids have been considered as one of the vital elements in upgrading current power systems to a system with more reliability and efficiency. Distributed generation is necessary for most of these new networks. Indeed, in all cases that DGs are used in distribution systems, protection coordination failures may occur in multiple configurations of smart grids using DGs. In different...
متن کاملOptimal Call Admission Control in Generalized Processor Sharing (GPS) Schedulers
Generalized Processor Sharing(GPS) is an idealized fluid discipline with a number of desirable properties. Its packetized version PGPS is considered to be a good choice as a packet scheduling discipline to guarantee Quality-of-Service in IP and ATM networks. The existing Connection Admission Control(CAC) frameworks for GPS result in a conservative resource allocation. We propose an Optimal CAC ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001